<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="utf-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW">
    <link rel="icon" href="../images/logo/logo.png" type="image/x-icon">
    <link rel="shortcut icon" href="../images/logo/logo.png"
          type="image/x-icon">
    <title>浏阳德塔软件开发有限公司 女娲计划</title>
</head>
<body style="Max-width: 700px; text-align:center; margin:auto;">
<div style="text-align:left; Max-width: 680px; margin-left:15px;">
    <a href="../">上一页</a>
    <br/>
    <br/>
    <br/>第十六章_TinShell插件_元基花模拟染色体组计算索引系统
    <br/> 作者: 罗瑶光, Author:Yaoguang.Luo<br/>

    <img class="banner_img" style="width: 100%" src="../images/5_7108/16/16_1.jpg"
         alt="浏阳德塔软件开发有限公司,罗瑶光"/>
    <img class="banner_img" style="width: 100%" src="../images/5_7108/16/16_2.jpg"
         alt="浏阳德塔软件开发有限公司,罗瑶光"/>


    <br/>

    <br/>元基花的优化方式
    <img class="banner_img" style="width: 100%" src="../images/5_7108/16/16_3.jpg"
         alt="浏阳德塔软件开发有限公司,罗瑶光"/>

    <br/>
    <br/>第十五章的新陈代谢铺垫
    <br/>
    <br/>组织文字进行对图片描述下, 图中的AOP. POM. VEC. SID 假设是一个函数的文件名,
    先不考虑文件中的各个函数名, 我们能很清楚的发现下面有很多文件都包含AOP. POM. 关键字,
    而后面的VOC. SID开始不一致, 于是可以将相同的前枝进行合并, 于是产生了V-E 和 V-O分叉,
    而后面的SID又可以合并. 这个分叉和归并的计算过程中, 相同的元基索引部分可以不断的过滤掉,
    这样一堆函数分类单体, 便可能逐渐归纳成一种树形的链状组合, 这个过程如图可理解为元基索引
    的新陈代谢过程.
    <br/>
    <br/>定义人 罗瑶光
    <br/>
    <br/>The organized definition of this photo is below. Initially, the
    assumption is that the indexed file name- is an Initons encoded file
    name with Its software functions and collections. The file name was
    'AOP.POM.VEC.SID.java'. firstly just focusing on this Initons-string
    target we could find this string which contains a keyword section of
    'AOP.POM.'. And this tail-root of 'VOC.SID', It would distinct other
    substrings with the same collection. So, we can make a combination of
    these same pre-root sections. Then this indexed Initons string did a
    separation of two sub roots, V-E and V-O. And then the trail of 'SID'
    will do a combination again. In this way, meta based Initons computing
    of separation and combination, again and again, means DNA-PDE
    catalytical computing. after this action, will make a filter of which
    the same sections and segments, means only save one section, thus,
    those sections and parts, do classification and fusion with similar to
    a string token segments network. It seems such as the tree or flower,
    has Its root and node. The author defined this procedure chain such
    likes a 'Meta-based Initons Catalyst and Metabolism'.
    <br/>
    <br/>Yaoguang Luo 稍后优化( trail 理解为 tail 这里)

    <br/>
    <br/>1 元基花的索引优化. refer page 下册299~ (传参因子[因子++])设计模式

    <br/><img class="banner_img" style="width: 100%" src="../images/5_7108/16/16_4.jpg"
              alt="浏阳德塔软件开发有限公司,罗瑶光"/>

    <br/>2 元基花的映射优化. refer page reflection 优化 见UML, 不断裁剪分出去即可,
    <br/>
    <br/>https://github.
    com/yaoguangluo/ChromosomeDNA/tree/main/2022/02/02
    <br/>
    <br/>3 元基花的文件细化. refer page 与sonar的规范一致, 国际统一, 文件大化小, 循环多化少,
    内容重化简,
    不多介绍了,
    <br/>
    <br/>4 元基花的新陈代谢. refer page 下册149, 更多见uml归纳.
    <br/>
</div>
</body>